strong typing

<programming> Strict enforcement of type rules with no exceptions. Incorrect type usage can be detected either at run time or at compile time. Strong typing catches more type errors than weak typing, resulting in fewer hard errors. In a strongly typed language, conversion between types requires the use of explicit conversion functions as opposed to implicit type coercion. Typing strength is a continuum; ML is more strongly typed than Java, which is more strongly typed than C. Strong or weak typing is independent of the choice between static typing and dynamic typing. Among strongly typed languages, Ada, Java, Haskell and ML are statically typed, whereas Python and Ruby are dynamically typed. (2004-07-20)

In computer programming, one of the many ways that programming languages are colloquially classified is whether the language's type system makes it strongly typed or weakly typed (loosely typed). However, there is no precise technical definition of what the terms mean and different authors disagree about the implied meaning of the terms and the relative rankings of the "strength" of the type systems of mainstream programming languages.

weak typing

<programming> Strict enforcement of type rules but with well-defined exceptions or an explicit type-violation mechanism. Weak typing is "friendlier" to the programmer than {strong typing}, but catches fewer errors at compile time. C and C++ are weakly typed, as they automatically coerce many types e.g. ints and floats. E.g. int a = 5; float b = a; They also allow ignore typedefs for the purposes of type comparison; for example the following is allowed, which would probably be disallowed in a strongly typed language: typedef int Date; /* Type to represent a date */ Date a = 12345; int b = a; /* What does the coder intend? */ C++ is stricter than C in its handling of enumerated types: enum animal CAT=0,DOG=2,ANT=3; enum animal a = CAT; /* NB The enum is optional in C++ */ enum animal b = 1; /* This is a warning or error in C++ */ (2000-07-04)

In functional analysis, a set-valued mapping A:X\to 2^X where X is a real Hilbert space is said to be strongly monotone if

In computer science, a typed assembly language (TAL) is an assembly language that is extended to include a method of annotating the datatype of each value that is manipulated by the code. These annotations can then be used by a program (type checker) that processes the assembly language code in order to analyse how it will behave when it is executed.

(SCC) A subset, S, of the nodes of a directed graph such that any node in S is reachable from any other node in S and S is not a subset of any larger such set. SCCs are {equivalence class}es under the transitive closure of the "directly connected to" relation. (1995-02-06)

A typed lambda calculus is a typed formalism that uses the lambda-symbol (\lambda) to denote anonymous function abstraction. In this context, types are usually objects of a syntactic nature that are assigned to lambda terms; the exact nature of a type depends on the calculus considered (see kinds below).

In set theory, an uncountable cardinal is inaccessible if it cannot be obtained from smaller cardinals by the usual operations of cardinal arithmetic. More precisely, a cardinal is strongly inaccessible if it is uncountable, it is not a sum of fewer than cardinals smaller than , and \alpha < \kappa implies 2^{\alpha} < \kappa.